An Effective Upperbound on Treewidth Using Partial Fill-in of Separators
نویسندگان
چکیده
Partitioning a graph using graph separators, and particularly clique separators, are well-known techniques to decompose a graph into smaller units which can be treated independently. It was previously known that the treewidth was bounded above by the sum of the size of the separator plus the treewidth of disjoint components, and this was obtained by the heuristic of filling in all edges of the separator making it into a clique. In this paper, we present a new, tighter upper bound on the treewidth of a graph obtained by only partially filling in the edges of a separator. In particular, the method completes just those pairs of separator vertices that are adjacent to a common component, and indicates a more effective heuristic than filling in the entire separator. We discuss the relevance of this result for combinatorial algorithms and give an example of how the tighter bound can be exploited in the domain of constraint satisfaction problems.
منابع مشابه
Exact Algorithms for Treewidth and Minimum Fill-In
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1.8899). Our results are based on combinatorial proofs that an n-vertex graph has O(1.7087) minimal separators and O(1.8135) potential maximal cliques. We also show that for the class of AT-free graphs the running time of our algorithms can be reduced to O(1.4142).
متن کاملOn Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
We present O(n’R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is the number of minimal separators of the input graph. This yields polynomial time algorithms for the four NP-complete graph problems on any subclass of the asteroidal triple-free graphs tha...
متن کاملExact (Exponential) Algorithms for Treewidth and Minimum Fill-In
We show that for a graph G on n vertices its treewidth and minimum fill-in can be computed roughly in 1.9601 time. Our result is based on a combinatorial proof that the number of minimal separators in a graph is O(n · 1.7087) and that the number of potential maximal cliques is O(n ·1.9601).
متن کاملPotential Maximal Clique Algorithms for Perfect Phylogeny Problems
Kloks, Kratsch, and Spinrad showed how treewidth and minimum-fill, NP-hard combinatorial optimization problems related to minimal triangulations, are broken into subproblems by block subgraphs defined by minimal separators. These ideas were expanded on by Bouchitté and Todinca, who used potential maximal cliques to solve these problems using a dynamic programming approach in time polynomial in ...
متن کامل